Polynomial time operations in explicit mathematics

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Time Operations in Explicit Mathematics

In this paper we study self applicative theories of operations and binary words in the context of polynomial time computability We propose a rst order theory PTO which allows full self application and whose provably total functions on W f g are exactly the polynomial time computable func tions Our treatment of PTO is proof theoretic and very much in the spirit of reductive proof theory

متن کامل

Elementary explicit types and polynomial time operations

This paper studies systems of explicit mathematics as introduced by Feferman [9, 11]. In particular, we propose weak explicit type systems with a restricted form of elementary comprehension whose provably terminating operations coincide with the functions on binary words that are computable in polynomial time. The systems considered are natural extensions of the first-order applicative theories...

متن کامل

Universes in explicit mathematics

This paper deals with universes in explicit mathematics. After introducing some basic definitions, the limit axiom and possible ordering principles for universes are discussed. Later, we turn to least universes, strictness and name induction. Special emphasis is put on theories for explicit mathematics with universes which are proof-theoretically equivalent to Feferman’s T0.

متن کامل

Explicit Conjunctions without Compilation: Computing hFF(PiC) in Polynomial Time

A successful partial delete relaxation method is to compute h in a compiled planning task Π which represents a set C of conjunctions explicitly. While this compilation view of such partial delete relaxation is simple and elegant, its meaning with respect to the original planning task is opaque. We provide a direct characterization of h(Π), without compilation, making explicit how it arises from...

متن کامل

Impredicative Overloading in Explicit Mathematics

We introduce the system OTN of explicit mathematics based on elementary separation, products, joins and weak power types. In this theory, we will define late-bound overloaded functions with a corresponding impredicative type structure à la λ&. Then we present a set-theoretic model for OTN which provides a denotational semantics for impredicative overloading without restricting itself to early-b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Symbolic Logic

سال: 1997

ISSN: 0022-4812,1943-5886

DOI: 10.2307/2275547